Join Sizes, Frequency Moments, and Applications
نویسندگان
چکیده
منابع مشابه
Estimating Frequency Moments of Streams
We will develop algorithms that can approximate Fk by making one pass of the stream and using a small amount of memory o(n+m). Frequency moments have a number of applications. F0 represents the number of distinct elements in the streams (which the FM-sketch from last class estimates using O(log n) space. F1 is the number of elements in the stream m. F2 is used in database optimization engines t...
متن کاملEstimating Frequency Moments of Streams
We will develop algorithms that can approximate Fk by making one pass of the stream and using a small amount of memory o(n+m). Frequency moments have a number of applications. F0 represents the number of distinct elements in the streams (which the FM-sketch from last class estimates using O(log n) space. F1 is the number of elements in the stream m. F2 is used in database optimization engines t...
متن کاملMulti-way spatial join selectivity for the ring join graph
Efficient spatial query processing is very important since the applications of the spatial DBMS (e.g. GIS, CAD/CAM, LBS) handle massive amount of data and consume much time. Many spatial queries contain the multi-way spatial join due to the fact that they compute the relationships (e.g. intersect) among the spatial data. Thus, accurate estimation of the spatial join selectivity is essential to ...
متن کاملFast similarity join for multi-dimensional data
To appear in Information Systems Journal, Elsevier, 2005 The efficient processing of multidimensional similarity joins is important for a large class of applications. The dimensionality of the data for these applications ranges from low to high. Most existing methods have focused on the execution of high-dimensional joins over large amounts of disk-based data. The increasing sizes of main memor...
متن کاملAn Adaptive Hash Join Algorithm for Multiuser Environments
As main memory becomes a cheaper resource, hash joins are an alternative to the traditional methods of performing equi-joins: nested loop and merge joins. This paper introduces a modified, adaptive hash join method that is designed to work with dynamic changes in the amount of available memory. The general idea of the algorithm is to regulate resource usage of a hash join in a way that allows i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016